Canonical spiking neuron network for spatiotemporal associative memory

ABSTRACT

Embodiments of the invention relate to canonical spiking neurons for spatiotemporal associative memory. An aspect of the invention provides a spatiotemporal associative memory including a plurality of electronic neurons having a layered neural net relationship with directional synaptic connectivity. The plurality of electronic neurons configured to detect the presence of a spatiotemporal pattern in a real-time data stream, and extract the spatiotemporal pattern. The plurality of electronic neurons are further configured to, based on learning rules, store the spatiotemporal pattern in the plurality of electronic neurons, and upon being presented with a version of the spatiotemporal pattern, retrieve the stored spatiotemporal pattern.

GOVERNMENT RIGHTS

This invention was made with Government support under Agreement No. HR0011-09-C-0002 awarded by Defense Advanced Research Projects Agency (DARPA). The Government has certain rights in the invention.

BACKGROUND

The present invention relates to neural systems, and more specifically, to spatiotemporal associative memory.

Biological systems impose order on the information provided by their sensory input. This information typically comes in the form of spatiotemporal patterns comprising localized events with a distinctive spatial and temporal structure. These events occur on a wide variety of spatial and temporal scales, and yet a biological system such as the brain is still able to integrate them and extract relevant pieces of information. Such biological systems can rapidly extract signals from noisy spatiotemporal inputs.

In biological systems, the point of contact between an axon of a neuron and a dendrite on another neuron is called a synapse, and with respect to the synapse, the two neurons are respectively called pre-synaptic and post-synaptic. The essence of our individual experiences is stored in the conductance of the synapses. The synaptic conductance can change with time as a function of the relative spike times of pre-synaptic and post-synaptic neurons, as per spike-timing dependent plasticity (STDP). The STDP rule increases the conductance of a synapse if its post-synaptic neuron fires after its pre-synaptic neuron fires, and decreases the conductance of a synapse if the order of the two firings is reversed.

Neuromorphic systems, also referred to as artificial neural networks, are computational systems that permit electronic systems to essentially function in a manner analogous to that of biological brains. Neuromorphic systems create connections between processing elements that are roughly functionally equivalent to neurons of a biological brain. Neuromorphic systems may comprise various electronic circuits that are modeled on biological neurons.

SUMMARY

Embodiments of the invention provide canonical spiking neurons for spatiotemporal associative memory. An aspect of the invention includes a method and system for spatiotemporal associative memory including a plurality of electronic neurons having a layered neural net relationship with directional synaptic connectivity. The plurality of electronic neurons are configured to detect the presence of a spatiotemporal pattern in a data stream, and extract the spatiotemporal pattern. Based on learning rules, the plurality of electronic neurons store the spatiotemporal pattern, and upon being presented with a version of the spatiotemporal pattern, retrieve the stored spatiotemporal pattern.

Another aspect of the invention includes a method for detecting the presence of a spatiotemporal pattern in a real-time data stream, extracting the spatiotemporal pattern, and based on learning rules, storing the spatiotemporal pattern in an associative memory comprising plurality of electronic neurons having a layered relationship with directional connectivity. Upon being presented with a version of the spatiotemporal pattern, the invention includes a method to retrieve the stored spatiotemporal pattern from the associative memory.

These and other features, aspects and advantages of the present invention will become understood with reference to the following description, appended claims and accompanying figures.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a diagram of a system for spatiotemporal associative memory, in accordance with an embodiment of the invention;

FIG. 2 shows a more detailed diagram of the system shown in FIG. 1, in accordance with an embodiment of the invention;

FIG. 3 shows a flowchart of the operation of a system for spatiotemporal associative memory, in accordance with an embodiment of the invention;

FIG. 4 shows a diagram of a neuromorphic system implementing a canonical spiking neuron method for spatiotemporal associative memory, in accordance with another embodiment of the invention;

FIG. 5 shows a diagram of a layered architecture of the system shown in FIG. 4, in accordance with another embodiment of the invention;

FIG. 6 shows a diagram of connections between the layers in the system shown in FIG. 5, in accordance with another embodiment of the invention;

FIG. 7 shows a diagram of a connection between neurons in two layers in the system shown in FIG. 6, in accordance with another embodiment of the invention;

FIG. 8 shows a curve of a spike-timing dependent plasticity learning rule employed in the system shown in FIG. 6, in accordance with an embodiment of the invention;

FIG. 9 shows an example of an ultra-dense synapse cross-bar array providing spike-timing dependent plasticity, useful for implementing one embodiment of the present invention; and

FIG. 10 shows a high level block diagram of an information processing system useful for implementing one embodiment of the present invention.

DETAILED DESCRIPTION

Embodiments of the invention provide neural systems, including canonical spiking circuits for associative memory configured to store and retrieve spatiotemporal patterns.

The term “electronic neuron” as used herein represents an architecture configured to simulate a biological neuron. An electronic neuron creates connections between processing elements that are roughly functionally equivalent to neurons of a biological brain. As such, a neural system comprising electronic neurons according to embodiments of the invention may include various electronic circuits that are modeled on biological neurons. Further, a neural system comprising electronic neurons according to embodiments of the invention may include various processing elements (including computer simulations) that are modeled on biological neurons. Although certain illustrative embodiments of the invention are described hereinbelow using electronic neurons comprising electronic circuits, the present invention is not limited to electronic circuits. A neural system according to embodiments of the invention can be implemented as a neuromorphic architecture comprising analog or digital circuitry, and additionally as a computer simulation. Indeed, the embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements.

An example architecture of a canonical spiking neuron system according to the invention includes neurons in layers, as well as their synaptic connections and learning rules between them. Such a system may be implemented in different ways, such as implementation through simulations on a traditional computer system or through a variety of different hardware schemes, one of which comprises synapse cross-bar array providing spike-timing dependent plasticity (described by example further below).

One embodiment of the invention comprises a spiking electronic neuron microcircuit implementing an unsupervised pattern recognition system of the associative memory type. Associative memory means a data storage device, wherein a stored memory is identified based on its informational content rather than an explicit address. Data may be retrieved from associative memory by accessing memory contents (as opposed to an explicit address) in serial or in parallel, wherein references are compared with informational content of the memory until a desirable set of one or more matches is found.

According to an embodiment of the invention, a pattern recognition system comprises an assembly of interacting spiking electronic neurons in a memory microcircuit configured to store and associatively recall spatiotemporal patterns. Learning rules provide (describe) the strengths of synaptic interconnections between the electronic neurons as a function of the patterns to be stored. For example, learning rules provide the level of conductance of synaptic interconnections between the electronic neurons as a function of the patterns to be stored.

According to an embodiment of the invention, an unsupervised pattern recognition system carries out pattern recognition tasks without any explicit external instruction mechanism. The system does not require any explicit description of the patterns. As such, the semantic content of the patterns is immaterial as long as the patterns have well defined spatiotemporal structure and statistics. Given an input data stream that contains spatiotemporal patterns, the system learns to detect the presence of the patterns, and to extract and store the patterns without requiring that any information about the patterns to be detected be provided ahead of time. The system stores the patterns in such a way that when presented with a fragmentary and/or noisy version of the stored pattern, the system is able to retrieve a proper matching pattern from memory.

In addition to the spatiotemporal patterns, the input data stream may in general contain a level of noise. The pattern recognition system carries out pattern recognition in a real-time or online fashion, and does not require separate stages for processing the incoming information. The system processes the incoming information in real-time as the data stream is fed in to the system. In an embodiment of the invention, the system architecture is modular and scalable, suitable for problems of a combinatorial nature on multiple spatial and temporal scales while using a single, streamlined architecture.

Referring now to FIG. 1, there is shown a diagram representation of the network architecture of a neural system 10, according to an embodiment of the invention. The system 10 comprises two layers E1 and E2 of excitatory spiking electronic neurons, and a layer I2 of inhibitory spiking electronic neurons. The E1 layer serves as the input layer while the E2 layer serves as the processing layer. The layer I2 implements a winner-take-all (WTA) mechanism as described further below in relation to FIG. 3.

Generally, an excitatory spiking electronic neuron makes its target neurons more likely to fire, while an inhibitory spiking electronic neuron makes its targets less likely to fire. A variety of implementations of spiking electronic neurons can be utilized. Generally, such neurons comprise a counter that increases when inputs from source excitatory neurons are received and decreases when inputs from source inhibitory neurons are received. The amount of the increase or decrease is dependent on the strength of the connection (e.g., synaptic connection modeled by a variable resistor), from a source neuron to a target neuron. If the counter reaches a certain threshold, the neuron then generates its own spike (i.e., fires) and the counter undergoes a reset to a baseline value. The term spiking electronic neuron is referred to as “electronic neuron” hereinafter.

The electronic neurons are interconnected as follows. FIG. 2 shows a more detailed diagram of the neural system 10, illustrating populations of electronic neurons 12 (i.e., N_(E1)) in the layer E1 connected to electronic neurons 14 (i.e., N_(E2)) in the layer E2, and the electronic neurons 14 connected to the electronic neurons 12. Further, the electronic neurons 14 in the layer E2 are also connected to populations of electronic neurons 16 (i.e., N_(I2)) in the layer I2, and the electronic neurons 16 are connected to the electronic neurons 14. The neuron connection model is general and can be tailored according to the associative data storage/retrieval functions desired. Typically, connections are made to multiple neurons, and the E1 and E2 layers comprise multiple neurons.

The input stream comprising spatiotemporal patterns as well as noisy inputs is fed into the E1 layer where it triggers the spiking activity of the electronic neurons 12 in the E1 layer. This spiking activity propagates forward to the electronic neurons 14 of the E2 layer. As such, presence of a spatiotemporal pattern in the input data stream produces a corresponding spatiotemporal spiking image of activity in the electronic neurons 12 in the layer E1. Any electronic neurons 14 of the E2 layer within the sphere of influence of the imprinted spatiotemporal spiking image will, by virtue of connection from the E1 layer, receive a certain excitatory signal level.

FIG. 3 is a flowchart showing a method 20 of the operation of the neural system 10 shown in FIGS. 1 and 2, in accordance with this embodiment of the invention. The process steps in FIG. 3 are not purely linear, but rather the E1 layer electronic neurons are constantly receiving input, and the E2 and I2 layer electronic neurons can fire at any time, depending on their input. Referring to FIG. 3, in step 21, one or more E1 layer electronic neurons 12 are activated by the input stream. In step 22, such activity can trigger an E2 layer electronic neuron 14. If neuron activity in the E2 layer follows neuron activity in the E1 layer within a short time period (e.g., about 50 ms), in step 23, the connection between such electronic neurons 12 and 14 is automatically strengthened (i.e., the conductance of a synaptic connection between the neurons 12 and 14 is increased).

Once an E2 layer electronic neuron 14 has been triggered (by one or more E1 layer electronic neurons 12), in step 24 the triggered E2 layer electronic neuron 14 triggers the activity of one or more I2 layer electronic neurons 16. In step 25, this in turn sends a strong inhibitory signal back to the E2 layer, thereby in step 26 suppressing further E2 layer activity for a brief time interval (e.g., about 10 ms).

When activity of a recently triggered E2 layer electronic neuron 14 is followed within a short time interval (e.g., about 50 ms) by the activity of an E1 layer electronic neuron 12 to which the electronic neuron 14 connects, the connection between the electronic neurons 12 and 14 is automatically weakened (i.e., the conductance of a synaptic connection between the neurons 12 and 14 is decreased).

However, if an E2 layer electronic neuron 14 fires (i.e., triggers or spikes) shortly after an E1 layer electronic neuron 12 (e.g., within about 50 ms) to which the electronic neuron 14 connects, the system 10 strengthens the connection between the electronic neurons 12 and 14.

Therefore, the connection from a given E2 layer electronic neuron 14 to a given E1 layer electronic neuron 12 is strengthened whenever it is likely that the electronic neuron 12 was involved in triggering the electronic neuron 14 in the first place. The outcome of the construction just described is that the system 10 develops a facility for enhancing associations between causal events, and suppressing acausal events.

In one embodiment of the invention, the overall stability and noise robustness of the system 10 is facilitated by implementing strength normalization. Strength normalization is accomplished by adjusting the strengths between electronic neuron connections. The system 10 is configured such that whenever the strength of a connection is increased, it is at the expense of the weakening of other connections within the system. This enables the electronic neurons to focus their influence where it is most effective, and ensures that effects due to noise become weaker in time. The normalization of connections is achieved by adjusting the strength of all excitatory synapses (connections) received by a neuron so that they remain at a constant value. Thus, if the strength of one connection to a neuron increases, the strengths of all other connections to that neuron should proportionally decrease to maintain a constant total input strength to that neuron. This is described by relation (6) described further below.

FIG. 4 shows a diagram of a neural system 30, according to another embodiment of the invention. The system 30 comprises comprising two layers E1 and E2 of excitatory electronic neurons. The system 10 further comprises two layers I1 and I2 of inhibitory electronic neurons. Referring to FIG. 5, in one embodiment of the invention, the system 30 comprises a layered architecture 35 with directional connectivity (feedforward and feedback), implementing interplay of a winner-take-all (WTA) process via lateral inhibition and spike driven learning rules which serve to select causal associations between events.

In one example, the WTA process generally models a neural net of excitatory neurons and an inhibitory neuron. Active excitatory neurons excite the inhibitory neuron. The inhibitory neuron inhibits the excitatory neurons. Activity of the inhibitory neuron increases until most excitatory neurons are inhibited.

The architecture 35 comprises said two layers E1 and E2 of excitatory electronic neurons, said two layers I1 and I2 of inhibitory electronic neurons, providing a feed forward (FF) path with STDP and synaptic plasticity (axonal/dendritic) and a feedback path (FB) with anti-STDP and synaptic plasticity (axonal/dendritic). Specifically, the architecture 35 provides directional connectivity between the neurons (feedforward and feedback), implementing WTA via lateral inhibition and spike driven learning rules which serve to select causal associations between events. The E1 layer receives spatio-temporal inputs (e.g., images of circles or squares with temporal variations in appearance), wherein input patterns presented to the E1 layer lead to compressed representations on the E2 layer.

Partial or corrupted versions of previously encountered patterns lead to error-free retrieval of complete versions. The feedback path (FB) connections exhibit anti-STDP (i.e., aSTDP). If a corrupt or incomplete input appears at the E1 layer, the correct E2 layer neurons should fire. Based on that E2 neuron firing, the full E1 input can be reconstructed. If E1 layer neurons fire before E2 layer neurons, synapses are weakened to remove spurious activity. If E2 layer neurons fire before E1 layer neurons, synapses are strengthened for pattern completion by enhancing connections from inputs seen earlier.

A spike signal creates a voltage bias across a synaptic connection (element), resulting in a current flow into down-stream neurons, such that the magnitude of the current is weighted by the conductance of the corresponding synaptic connection. In one example, a random distribution of weights is utilized, such that each E2 neuron needs input from 10% of E1 neurons, in order to spike. The feed forward (FF) connections exhibit STDP, wherein inputs leading to significant spatiotemporal correlations in E1 layer neuronal activity causes certain E2 layer neurons to fire. The I2 layer ensures that the activity in the E2 layer is limited to a very small number. If E1 layer neurons fire before E2 layer neurons, this leads to strengthening synapses to form associations. If E2 layer neurons fire before E1 layer neurons, this leads to weakening synapses to wash out noise.

FIG. 6 shows a more detailed diagram of the neural system 30, illustrating that E1 and E2 layers comprise populations of excitatory electronic neurons 12 and 14 (i.e., NE1 and NE2), respectively. Further, I1 and I2 layers comprise populations (grid) of inhibitory electronic neurons 16 and 18 (i.e., NI1 and NI2), respectively. E1 layer electronic neurons serve as input neurons, while E2 electronic neurons support higher level processing. Connections 11 between neurons in different layers are as shown in more detail in FIG. 7. Connections between layers are made from each neuron (A_(n)) in a source layer S to a point, target neuron B_(n), in the target layer T that corresponds topographically with the location of the source A_(n) in the source layer. The source neuron A_(n) is connected to all neurons in the target layer within a certain radius (from 0 to ∞) of the target neuron B_(n).

FIG. 8 shows a spike-timing dependent plasticity learning rule employed in the system 30 (FIG. 6) as described in S. Song, K. D. Miller, and L. F. Abbott, “Competitive Hebbian learning through spike-timing-dependent synaptic plasticity,” Nature Neuroscience, vol. 3, September 2000, pp. 919-926. The horizontal axis (x-axis) represents the time of the post-synaptic neuron spike minus the time of the pre-synaptic neuron spike. The vertical axis (y-axis) represents the change in synaptic weight, ΔW, resulting from pre-post pairings with different timing. The curves 13 are derived from the equation:

ΔW=A ₊ e ^((t) ^(pre) ^(−t) ^(post) ^()/τ) ⁺ if t _(pre) <t _(post), else

ΔW=A ⁻ e ^((t) ^(pre) ^(−t) ^(post) ^()/τ) ⁻

where A₊ and A⁻ can be positive or negative numbers and determines the size of weight change for a given timing difference, and τ is a time constant (described in more detail further below).

The electronic neurons are interconnected as follows. Each electronic neuron makes a fixed number, M, of outgoing connections with other electronic neurons. Each E1 layer electronic neuron connects to I1 layer and E2 layer electronic neurons. Each I1 layer electronic neuron connects exclusively to E1 layer electronic neurons. Similarly, each E2 layer electronic neuron connects to I2 layer and E1 layer electronic neurons. Each I2 layer electronic neuron connects exclusively to E2 layer electronic neurons. Each pathway connecting any pair of neurons is also assigned a conduction delay. The connections and the delays can be assigned either randomly (e.g., drawn from a distribution) or in a predetermined topographic fashion depending on the intended application. No population is allowed to connect back to itself.

In general, the system construction is independent of the details of the spike generating mechanism used. For completeness, a variation of the Izhikevich/Brette-Gerstner models where the dynamics of each spiking neuron is determined in terms of its depolarization variable V via equation (1) below may be used:

$\begin{matrix} {{{\overset{.}{V}(t)} = {{F\left( {V,t} \right)} - {u(t)} + {I(t)}}}{{\overset{.}{u}(t)} = {- {\frac{1}{\tau_{u}}\left\lbrack {{u(t)} = {{bV}(t)}} \right\rbrack}}}} & (1) \end{matrix}$

The variable u denotes the neuron's adaptation/recovery variable, while b and τ_(u) are constant parameters. F is typically a convex function chosen to guarantee the existence of solutions, V (t), to equation (1) which rapidly “blow-up” when subjected to sufficiently large inputs I within a given time interval. These “explosive” events are then interpreted as spikes. Once a spike has been registered, the variable V is reset to a resting state while the adaptation variable is appropriately adjusted to account for the initiation of a recovery phase. Operationally, the spikes are captured by introducing a threshold Vthr so that a neuron is said to have fired at time t if V (t)>Vthr. Each spike is represented in terms of a binary-valued activity variable ξ(t) via relationship (2) below:

$\begin{matrix} {{\xi (t)} = \left\{ {\begin{matrix} 1 & {{{if}\mspace{14mu} {V(t)}} > V_{thr}} \\ 0 & {otherwise} \end{matrix}.} \right.} & (2) \end{matrix}$

All neurons in this construction are governed by equation (1) and thus have identical behavior if subjected to identical inputs. Therefore, any variation in dynamical behavior arises only from variations in the inputs I(t). The populations E1, E2, I1 and I2 interact with each other through such input terms. For clarity of description, the populations of neurons are distinguished in terms of their inputs, and E1 and I1 neurons are labeled using indices from the sequence {j, k, . . . }. The E2 and I2 neurons are labeled using indices from the sequence {α, β, . . . }. Inputs to E1 neurons initiate from three sources. As discussed above, in addition to receiving external stimuli (via sensory pathways), E1 neurons also receive inputs from both I1 and E2 neurons. These sources collectively contribute to equation (1) an input term I(t) of the form in relation (3) below:

$\begin{matrix} {{I_{j}(t)} = {{I_{j}^{ext}(t)} + {\sum\limits_{a \in {E\; 2}}{{W_{j\; \alpha}(t)}{\xi_{\alpha}\left( {t - \Delta_{j\; \alpha}} \right)}}} - {\sum\limits_{k \in {I\; 1}}{W_{jk}{\xi_{k}\left( {t - \Delta_{jk}} \right)}}}}} & (3) \end{matrix}$

where I_(j) ^(ext) refers to the external stimulus, Wjα and Wjk are non-negative quantities denoting the strengths of E2

E1 and I1

E1 synapses respectively, while Δjα denotes the (axonal) conduction delay between the source α and target neuron j.

Inputs to E2 neurons take the same form as relation (3) with the obvious changes in notation: substituting E2 indices for E1 indices and I1 indices for I2 indices on the right-hand side of relation (3). Since E2 neurons do not receive external stimuli, then set I^(ext)=0. Inputs to both I1 and I2 neurons also take the form of relation (3), except that in addition to setting I^(ext)=0, the inhibitory inputs are omitted since, as discussed above, I1 and I2 neurons interact only with excitatory neurons.

The strengths of E1

E2 and E2

E1 synapses are time-dependent (i.e., subject to plasticity), whereas all other synaptic weights remain fixed in time. This construction imposes two forms of plasticity mechanisms: the weights from E1

E2 evolve under conventional STDP rules, while those from E2

E1 evolve under anti-STDP. In a typical form of the rule, every registered pair of pre- and post-synaptic spike events, at t_(pre) and t_(post), induces a change, ΔW_(pre,post), in the strength of the synapse between the given pair of neurons (labeled here by pre and post). This change takes the form of relation (4) below:

$\begin{matrix} {{\Delta \; W_{{pre},{post}}} = \left\{ \begin{matrix} {A_{+}{\exp \left\lbrack {{- \left( {t_{post} - t_{pre}} \right)}\text{/}\tau} \right\rbrack}} & {{{if}\mspace{14mu} t_{post}} \geq t_{pre}} \\ {{- A_{\_}}{\exp \left\lbrack {{- \left( {t_{pre} - t_{post}} \right)}\text{/}\tau} \right\rbrack}} & {{{if}\mspace{14mu} t_{post}} < t_{pre}} \end{matrix} \right.} & (4) \end{matrix}$

Where A₊, A⁻ and τ are positive constants. The anti-STDP rule employed in the construction according to the invention takes the form of relation (5) below:

$\begin{matrix} {{\Delta \; W_{{pre},{post}}} = \left\{ \begin{matrix} {{- B_{\_}}{\exp \left\lbrack {{- \left( {t_{post} - t_{pre}} \right)}\text{/}\tau} \right\rbrack}} & {{{if}\mspace{14mu} t_{post}} \geq t_{pre}} \\ {B_{+}{\exp \left\lbrack {{- \left( {t_{pre} - t_{post}} \right)}\text{/}\tau} \right\rbrack}} & {{{if}\mspace{14mu} t_{post}} < t_{pre}} \end{matrix} \right.} & (5) \end{matrix}$

with positive constants B₊, B⁻ and τ.

The competitive aspect of the dynamics is implemented utilizing a “normalized” version of the weights. Let t+ denote the time immediately following any elementary update time t in the course of a simulation. Constrain the weights associated with any given neuron, say α, by:

$\begin{matrix} {\frac{W_{\alpha \; j}\left( t_{+} \right)}{\sum_{k}{W_{\alpha \; k}(0)}} \equiv \frac{W_{\alpha \; j}(t)}{\sum_{k}{W_{\alpha \; k}(t)}}} & (6) \end{matrix}$

guaranteeing that Σ_(k) W_(αk) (t₊) remains constant for all t and α. This constraint is supplemented by a hard-and-fast rule which, by fiat, ensures that 0≦W_(αj)≦W_(max), for all indices α, j, and a pre-determined constant W_(max). The competitive dynamics is further facilitated by introducing a process for contrast enhancement in the inputs, which involves replacing I_(j)(t) in relation (3) with relation (7) below:

$\begin{matrix} {{{I_{j}\left( t_{+} \right)} \equiv {{I_{j}(t)} - {\frac{1}{N_{E\; 1}}{\sum\limits_{k \in {E\; 1}}{{I_{k}(t)}\mspace{14mu} {for}\mspace{14mu} {all}\mspace{14mu} j}}}}} \in {E\; 1}} & (7) \end{matrix}$

Similar expressions for inputs to E2, I1 and I2 are obtained by an appropriate commutation of indices.

A protocol for the presentation of inputs is outlined below. This protocol involves arbitrarily partitioning the input electronic neuron array, E1, into p clusters (indexed by μ=1, . . . , p) with each cluster containing approximately the same number of input neurons. In this example, the presentation of a particular input pattern manifests itself as a flurry of activity over a fixed time interval, confined mainly to a particular cluster. The confinement need not be strict, and partial overlaps are allowed, as well as sporadic events anywhere on the neuron array. This allows association of specific “temporal input patterns” with specific input clusters.

In one example scenario below, patterns are presented to E1, one at a time, over intervals of length T, and each presentation is followed by a silent period of length T_(s). Taking Δt as the elementary unit of time, let T, Ts>>Δt, set T₊=T+T_(s), and let T_(train)>>T, T_(s) be the duration of a “training” phase. A protocol for the presentation of inputs (stimulus) is as follows in Table 1:

TABLE 1 1. Set λ = 1, μ = 1, t₁ ⁽¹⁾ ≡ 0. 2. While t_(λ) ^((μ)) + T_(t) ≧ T_(train) Fix a time interval [t_(λ) ^((μ)) , t_(λ) ^((μ)) + T) ∪ [t_(λ) ^((μ)) + T, t_(λ) ^((μ)) + T₊) along with the cluster E1μ . At each step t, if t ∈ [t_(λ) ^((μ)) , t_(λ) ^((μ)) + T) , select a random neuron j ∈ E1μ and inject that neuron with a superthreshold input I_(å) guaranteeing that the neuron fires. else if t ∈ [t_(λ) ^((μ)) + T, t_(λ) ^((μ)) + T₊) enter the silent phase. 3. At the end of the silent phase, if μ < p, set t_(λ) ^((μ+1)) = t_(λ) ^((μ)) + T₊, advance μ← μ + 1, and proceed to step 2. else if μ = p, set t_(λ+1) ⁽¹⁾ = t_(λ) ^((p)) + T₊, advance λ← λ + 1, reset μ← 1, and proceed to step 2.

Table 2 below illustrates an online implementation of the input presentation protocol above, wherein the routine Choose (n,E1μ) returns a list of n E1 neurons to be triggered.

TABLE 2   Subroutine stimulusProtocol  parameters p, T, T₊, T_(train), a partition E1 = ∪_(μ=1) ^(p) E1μ.  inputs t.  τ = t mod pT₊   ${{{if}\mspace{14mu} \tau \mspace{14mu} {mod}\mspace{11mu} T_{+}} \geq {T\mspace{11mu} \left( {{i.e.},{{in}\mspace{14mu} {silent}\mspace{14mu} {phase}}} \right)}},{{{set}\mspace{14mu} {\overset{\rightarrow}{I}}^{ext}\mspace{14mu} (t)} = {\overset{\rightarrow}{0}.}}$  else   $\begin{matrix} {\mu = {1 + \frac{\tau - \left( {\tau \mspace{20mu} {mod}\mspace{11mu} T_{+}} \right)}{T_{+}}}} \\ {{I_{j}^{ext}(t)} = \left\{ {\begin{matrix} I_{å} & {{{if}\mspace{11mu} j}\; \in \; {{Choose}\left( {n,{E\; 1\mu}} \right)}} \\ 0 & {otherwise} \end{matrix}.} \right.} \end{matrix}\quad$

Variations of the stimulus (input) protocol at different levels of complexity are possible, without affecting the outcome according to embodiments of the invention. Example variations include introducing levels of noise in the stimulus (inputs), as well as allowing for overlapping patterns, e.g., the activity of E1μ may partially coincide with that of E1ν for μ≠ν.

In accordance with the input/stimulus presentation protocol outlined above, during the training phase, the pattern E1μ is presented to the neural system (network) for the nth time in the time interval:

τ(n,μ)≡[(np+μ−1)T ₊,(np+μ)T ₊)  (8)

A particular subset of E1 units in the pattern μ for activation at each time step tετ(n, μ) is selected, wherein selectE1(t) denotes such a subset, and firedE1(t) denotes the set of E1 neurons observed to have fired at time t, selectE1(t)≡Ø is adopted for all t<0. Now define E1′(n, μ; t)≡firedE1(t)\ selectE1(t−Δt) and

${E\; 1^{\prime}\left( {n,\mu} \right)}:={\bigcup\limits_{t \in {\tau {({n,\mu})}}}{E\; 1^{\prime}\left( {n,{\mu;t}} \right)}}$

Thus, E1′(n, μ) comprises the set of E1 neurons which can only have fired via recurrent (feedback) activity. As such, for each n and μ, relation (9) provides the measures:

$\begin{matrix} {{{R\left( {n,\mu} \right)} \equiv \frac{{{E\; 1\mu}\bigcap{E\; 1^{\prime}\left( {n,\mu} \right)}}}{{E\; 1\mu}}},{{P\left( {n,\mu} \right)} \equiv \frac{{{E\; 1\mu}\bigcap{E\; 1^{\prime}\left( {n,\mu} \right)}}}{{E\; 1\mu}}},} & (9) \end{matrix}$

wherein ∥S∥ denotes the cardinality of a set S, and 0≦R(n, μ), P(n, μ)≦1, such that since E1′(n, μ) is the reciprocated image of input (feedforward) activity registered in E1, then R(n, μ) measures the amount of “reciprocal image agrees with the actual input,” i.e., R(n, μ) is large for a high level of agreement between the reciprocated image and actual input, and low otherwise. R(n, μ) is thus a measure of “recall”, such that upon being presented with a version of the spatiotemporal pattern, the system retrieves the stored spatiotemporal pattern. Similarly, P(n, μ) measures the “precision” with which associations between actual and induced activities are made.

Averaged versions of said measure are:

${{R(\mu)} \equiv {\frac{1}{N}{\sum\limits_{n = 1}^{N}{R\left( {n,\mu} \right)}}}},{R \equiv {\frac{1}{p}{\sum\limits_{\mu = 1}^{p}{R(\mu)}}}}$ ${{P(\mu)} \equiv {\frac{1}{N}{\sum\limits_{n = 1}^{N}{P\left( {n,\mu} \right)}}}},{P \equiv {\frac{1}{p}{\sum\limits_{\mu = 1}^{p}{P(\mu)}}}}$ ${{\hat{P}(\mu)} \equiv {\frac{1}{N}{\sum\limits_{n = 1}^{N}{\hat{P}\left( {n,\mu} \right)}}}},{\hat{P} \equiv {\frac{1}{p}{\sum\limits_{\mu = 1}^{p}{\hat{P}(\mu)}}}}$

Table 3 illustrates an example simulation according to the invention, wherein the notation {right arrow over (q)} denotes objects with the structure {right arrow over (q)}:=(q_(E1), q_(E2), q_(I1), q_(I2)), where the indices E1, E2, I1, and I2 serve as multi-indices labeling quantities in populations E1, E2, I1, and I2. Further, M_(E1,E2) refers to a matrix M with row indices in E1 and column indices in E2. Given any two matrices M and Δ, the operator ★ is defined by setting

(Må{right arrow over (q)}(t−Δ))m≡Σ _(n) M _(mn) q _(n)(t−Δ _(mn))

wherein an elementary time step scaled to in appropriate units is utilized, such that:

TABLE 3 I. Set-up static parameters: network connectivity matrix c, conduction delay matrix Δ, Δ_(max) := max(Δ) , static weights W_(E1,I1),W_(I1,E1),W_(E2,I2), W_(I2,E2) II. Initialize dynamic variables {right arrow over (V)}, {right arrow over (u)}, and W⁺ := (W_(E1,E2),W_(E2,E1)) . Initialize dynamic variables: {right arrow over (ξ)}(−Δ_(max)) =: {right arrow over (ξ)}(−Δ_(max) + 1) = ... = {right arrow over (ξ)}(0) = {right arrow over (0)} . III. For 0 ≦ t < T_(stop) , {right arrow over (I)}^(ext) (t) = stimulusProtocol(t) , {right arrow over (I)}^(syn) (t) = W(t) å {right arrow over (ξ)}(t − Δ) ,  {right arrow over (I)}_(contrast)(t) = {right arrow over (I)}^(ext) (t) + {right arrow over (I)}^(syn) (t) − 

 {right arrow over (I)}^(ext) (t) + {right arrow over (I)}^(syn) (t) 

 _(population avg.)  ({right arrow over (V)}(t + 1),{right arrow over (u)}(t + 1),{right arrow over (ξ)}(t + 1)) = updateState({right arrow over (V)}(t),{right arrow over (u)}(t),{right arrow over (I)}_(contrast)(t))  W⁺ (t + 1) = updateWeights(t,W⁺ (t),{{right arrow over (ξ)}(s)|s ∈ [t − Δ_(max),t]}) Subroutine stimulusProtocol returns {right arrow over (I)}^(ext) (t) (i.e., Table 2). Subroutine updateState Parameters b, τ_(u), V_(reset), V_(thr),...  inputs {right arrow over (V)}(t),u({right arrow over (t)}),{right arrow over (I)}_(contrast)(t) via rquation (1).  returns {right arrow over (V)}(t + 1),{right arrow over (u)}(t + 1),{right arrow over (ξ)}(t + 1) via equation (1). Subroutine updateWeights Parameters A₊,A⁻,B₊,B⁻,τ,Δ_(max) Inputs t,W_(E1,E2)(t),W_(E2,E1)(t),{ξ^(→)(s)}_(s=t−Δ) _(max) ^(t) Update W_(E1,E2) and W_(E2,E1) via STDP and anti-STDP respectively using activity histories (i.e., equations (4) and (5)). Enforce 0 ≦ W_(E1,E2),W_(E2,E1) ≦ W_(max) . Normalize the result using relation (6). returns W_(E1,E2)(t + 1),W_(E2,E1)(t + 1)

In one embodiment of the invention, the temporal span of the input pattern, though random and variable, falls within given lower and upper bounds, such as between about 10 ms and about 100 ms. Noise, however, is assumed to be continuously present in the input pattern. The patterns occur repeatedly over reasonably long time intervals. In one example, a spatial scale determines whether a particular series of spatiotemporal events constitute a pattern.

A neural method and system according to an embodiment of the invention implements features of cortical networks, including spiking neurons, spike-time driven learning rules and recurrent connections between neurons. The system requires only a single spike per neuron to perform input pattern identification and subsequent pattern recall, following an unsupervised training session. The system may serve as an intermediate processing stage of a larger system, wherein a functionally significant amount of processing can occur under time constraints similar to those suggested by neurobiological experiments.

According to an embodiment of the invention, the neural system implements an architecture configured to accommodate spiking neurons with competitive dynamics and unsupervised learning. The neural system implements transient neuron assemblies with activity that extinguishes as soon as a successful retrieval has been carried out and once the pattern is deactivated. Such transient assemblies allow for an efficient rapid successive activation and retrieval of memories. The neural system comprises a dedicated neural circuit for pattern completion with the ability to pinpoint events that require attention and subsequent analysis. The neural system is readily amenable to incorporation into a modular framework, with each module having the basic two-layer electronic neuron implementation disclosed herein.

As an example, a modular framework construction comprises stacking the basic two-layer modules in a hierarchical fashion, with each level in the hierarchy representing features at varying degrees of abstraction. Additional neuron layers (e.g., E2 a, E2 b, etc.) may be added to the basic two-layer system, with each neuron layer responding, in parallel, to different pattern features in the same input stream. This can be achieved by using different receptive field profiles for each neuron layer sheet. Alternatively, the system may comprise multiple E1 layers with distinct input streams all feeding into a single E2 layer. The system can consolidate previously-learned patterns into complex composites by taking various permutations and combinations of these alternatives.

The embodiments of the invention can take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment containing both hardware and software elements. An example architecture of a canonical spiking neuron system according to the invention as described above includes neurons in layers E1, E2, I1 and I2 as well as their connections and learning rules between them. Such a system may be implemented in different ways, such as implementation through simulations on a traditional computer system or through a variety of different hardware schemes, one of which comprises an ultra-dense synapse cross-bar array providing spike-timing dependent plasticity.

The term “ultra-dense cross-bar array” as used herein refers to cross-bar arrays that may have a pitch in the range of about 0.1 nm to 10 μm. FIG. 9 shows an example neural system including a cross-bar array 100 having a plurality of neurons 15, 17, 19 and 21. These neurons are also referred to herein as “electronic neurons.” Neurons 15 and 17 are axonal neurons and neurons 19 and 21 are dendritic neurons. Axonal neurons 15 and 17 are shown with outputs 22 and 24 connected to axons 26 and 28, respectively. Dendritic neurons 19 and 21 are shown with inputs 30 and 32 connected to dendrites 34 and 36, respectively. Axonal neurons 15 and 17 also contain inputs and receive signals along dendrites, however, these inputs and dendrites are not shown for simplicity of illustration. Thus, the axonal neurons 15 and 17 will function as dendritic neurons when receiving inputs along dendritic connections. Likewise, the dendritic neurons 19 and 21 will function as axonal neurons when sending signals out along their axonal connections. When any of the neurons 15, 17, 19 and 21 fire, they will send a pulse out to their axonal and to their dendritic connections.

Each connection between axons 26, 28 and dendrites 34, 36 are made through a variable state resistor 38, 40, 42 and 44. The junctions where the variable state resistors are located may be referred to herein as “cross-point junctions.” The term “variable state resistor” refers to a class of devices in which the application of an electrical pulse (either a voltage or a current) will change the electrical conductance characteristics of the device. For a general discussion of cross-bar array neural systems, as well as to variable state resistors as used in such cross-bar arrays, reference is made to K. Likharev, “Hybrid CMOS/Nanoelectronic Circuits: Opportunities and Challenges”, J. Nanoelectronics and Optoelectronics, 2008, Vol. 3, p. 203-230, 2008, which is hereby incorporated by reference. In one embodiment of the invention, the variable state resistor may comprise a phase change memory (PCM). Besides PCM devices, other variable state resistor devices that may be used in embodiments of the invention include devices made using metal oxides, sulphides, silicon oxide and amorphous silicon, magnetic tunnel junctions, floating gate FET transistors, and organic thin film layer devices, as described in more detail in the above-referenced article by K. Likharev. The variable state resistor may also be constructed using a static random access memory device. Also attached to the variable state resistors is an access device 39, which may comprise a PN diode, an FET wired as a diode, or some other element with a nonlinear voltage-current response.

Neurons 15, 17, 19 and 21 each include a pair of RC circuits 48. In general, in accordance with an embodiment of the invention, axonal neurons 15 and 17 will “fire” (transmit a pulse) when the inputs they receive from dendritic input connections (not shown) exceed a threshold. When axonal neurons 15 and 17 fire they maintain an A-STDP variable that decays with a relatively long, predetermined, time constant determined by the values of the resistor and capacitor in one of its RC circuits 48. For example, in one embodiment, this time constant may be 50 ms. The A-STDP variable may be sampled by determining the voltage across the capacitor using a current mirror, or equivalent circuit. This variable is used to achieve axonal STDP, by encoding the time since the last firing of the associated neuron. Axonal STDP is used to control “potentiation”, which in this context is defined as increasing synaptic conductance.

When dendritic neurons 19, 21 fire they maintain a D-STDP variable that decays with a relatively long, predetermined, time constant based on the values of the resistor and capacitor in one of its RC circuits 48. For example, in one embodiment, this time constant may be 50 ms. In other embodiments this variable may decay as a function of time. For example the variable may decay according to linear, polynomial, or quadratic functions. In another embodiment of the invention, the variable may increase instead of decreasing over time. In any event, this variable may be used to achieve dendritic STDP, by encoding the time since the last firing of the associated neuron. Dendritic STDP is used to control “depression,” which in this context is defined as decreasing synaptic conductance.

Embodiments of the invention can take the form of a computer simulation or program product accessible from a computer-usable or computer-readable medium providing program code for use by or in connection with a computer, processing device, or any instruction execution system. As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing. Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).

Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.

FIG. 10 is a high level block diagram showing an information processing system useful for implementing one embodiment of the present invention. The computer system includes one or more processors, such as a processor 102. The processor 102 is connected to a communication infrastructure 104 (e.g., a communications bus, cross-over bar, or network).

The computer system can include a display interface 106 that forwards graphics, text, and other data from the communication infrastructure 104 (or from a frame buffer not shown) for display on a display unit 108. The computer system also includes a main memory 110, preferably random access memory (RAM), and may also include a secondary memory 112. The secondary memory 112 may include, for example, a hard disk drive 114 and/or a removable storage drive 116, representing, for example, a floppy disk drive, a magnetic tape drive, or an optical disk drive. The removable storage drive 116 reads from and/or writes to a removable storage unit 118 in a manner well known to those having ordinary skill in the art. Removable storage unit 118 represents, for example, a floppy disk, a compact disc, a magnetic tape, or an optical disk, etc., which is read by and written to by removable storage drive 116. As will be appreciated, the removable storage unit 118 includes a computer readable medium having stored therein computer software and/or data.

In alternative embodiments, the secondary memory 112 may include other similar means for allowing computer programs or other instructions to be loaded into the computer system. Such means may include, for example, a removable storage unit 120 and an interface 122. Examples of such means may include a program package and package interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 120 and interfaces 122 which allow software and data to be transferred from the removable storage unit 120 to the computer system.

The computer system may also include a communications interface 124. Communications interface 124 allows software and data to be transferred between the computer system and external devices. Examples of communications interface 124 may include a modem, a network interface (such as an Ethernet card), a communications port, or a PCMCIA slot and card, etc. Software and data transferred via communications interface 124 are in the form of signals which may be, for example, electronic, electromagnetic, optical, or other signals capable of being received by communications interface 124. These signals are provided to communications interface 124 via a communications path (i.e., channel) 126. This communications path 126 carries signals and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an radio frequency (RF) link, and/or other communication channels.

In this document, the terms “computer program medium,” “computer usable medium,” and “computer readable medium” are used to generally refer to media such as main memory 110 and secondary memory 112, removable storage drive 116, and a hard disk installed in hard disk drive 114.

Computer programs (also called computer control logic) are stored in main memory 110 and/or secondary memory 112. Computer programs may also be received via a communication interface 124. Such computer programs, when run, enable the computer system to perform the features of the present invention as discussed herein. In particular, the computer programs, when run, enable the processor 102 to perform the features of the computer system. Accordingly, such computer programs represent controllers of the computer system. The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. 

What is claimed is:
 1. A method comprising: receiving an input data stream comprising one or more spatiotemporal patterns; extracting the one and more spatiotemporal patterns; storing the one or more spatiotemporal patterns in memory; and performing one or more pattern recognition tasks based on the one or more spatiotemporal patterns; wherein performing one or more pattern recognition tasks comprises, in response to receiving a version of the one or more spatiotemporal patterns, retrieving the one or more spatiotemporal patterns from the memory.
 2. The method of claim 1, wherein the version of the one or more spatiotemporal patterns comprises one of a fragmentary or noisy version of the one or more spatiotemporal patterns.
 3. The method of claim 1, wherein the one or more pattern recognition tasks are performed without any external instructions, the external instructions comprising an explicit description indicative of semantic content of the one or more spatiotemporal patterns.
 4. The method of claim 1, further comprising: detecting presence of spatiotemporal patterns in an input data stream; and extracting and storing the spatiotemporal patterns without requiring any information about the spatiotemporal patterns in advance.
 5. A system comprising a computer processor, a computer-readable hardware storage device, and program code embodied with the computer-readable hardware storage device for execution by the computer processor to implement a method comprising: receiving an input data stream comprising one or more spatiotemporal patterns; extracting the one and more spatiotemporal patterns; storing the one or more spatiotemporal patterns in memory; and performing one or more pattern recognition tasks based on the one or more spatiotemporal patterns; wherein performing one or more pattern recognition tasks comprises, in response to receiving a version of the one or more spatiotemporal patterns, retrieving the one or more spatiotemporal patterns from the memory.
 6. The system of claim 5, wherein the version of the one or more spatiotemporal patterns comprises one of a fragmentary or noisy version of the one or more spatiotemporal patterns.
 7. The system of claim 5, wherein the one or more pattern recognition tasks are performed without any external instructions, the external instructions comprising an explicit description indicative of semantic content of the one or more spatiotemporal patterns.
 8. The system of claim 5, the method further comprising: detecting presence of spatiotemporal patterns in an input data stream; and extracting and storing the spatiotemporal patterns without requiring any information about the spatiotemporal patterns in advance.
 9. A computer program product comprising a computer readable hardware storage device having program code embodied therewith, the program code being executable by a computer to implement a method comprising: receiving an input data stream comprising one or more spatiotemporal patterns; extracting the one and more spatiotemporal patterns; storing the one or more spatiotemporal patterns in memory; and performing one or more pattern recognition tasks based on the one or more spatiotemporal patterns; wherein performing one or more pattern recognition tasks comprises, in response to receiving a version of the one or more spatiotemporal patterns, retrieving the one or more spatiotemporal patterns from the memory.
 10. The computer program product of claim 9, wherein the version of the one or more spatiotemporal patterns comprises one of a fragmentary or noisy version of the one or more spatiotemporal patterns.
 11. The computer program product of claim 9, wherein the one or more pattern recognition tasks are performed without any external instructions, the external instructions comprising an explicit description indicative of semantic content of the one or more spatiotemporal patterns.
 12. The computer program product of claim 9, the method further comprising: detecting presence of spatiotemporal patterns in an input data stream; and extracting and storing the spatiotemporal patterns without requiring any information about the spatiotemporal patterns in advance. 